Approval Voting and Parochialism

نویسندگان

  • JONATHAN BARON
  • NICOLE Y. ALTMAN
  • STEPHAN KROLL
چکیده

In hypothetical scenarios involving two groups (nations or groups of workers), subjects voted on three proposals: one helped group A (their group), one helped B, and one helped both groups, more than the average of the first two but less than their maximum. When subjects voted for one proposal, most voted for the one that helped group A. This result is “parochial” because it helps the voter’s own group even though it hurts the other group more. When voters could approve two proposals, they tended to approve the third proposal as well, and it was more likely to win. Approval voting can thus reduce the effect of parochialism, a bias toward one’s own group, on election outcomes. In a second experiment, the authors replicated this effect using realmoney payoffs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Manipulability of Votes: The Case of Approval Voting

The famous result of Gibbard and Satterthwaite shows that every voting procedure is manipulable if the voters can have any preferences over the candidates. That is, a voter may improve the voting result by not voting according to his true preference. Approval voting, introduced by Brams and Fishburn, is not manipulable if preferences are dichotomous: each voter only distinguishes between accept...

متن کامل

Proportional Approval Method using Squared loads, Approval removal and Coin-flip approval transformation (PAMSAC) - a new system of proportional representation using approval voting

Several multi-winner systems that use approval voting have been developed but they each suffer from various problems. Six of these methods are discussed in this paper. They are Satisfaction Approval Voting, Minimax Approval Voting, Proportional Approval Voting, Monroe's Fully Proportional Representation, Chamberlin-Courant's Rule, and Ebert's method. They all fail at least one of Proportional R...

متن کامل

Conditional and Sequential Approval Voting on Combinatorial Domains

Several methods exist for making collective decisions on a set of variables when voters possibly have preferential dependencies. None is based on approval voting. We define a family of rules for approval-based voting on combinatorial domains, where voters cast conditional approval ballots, allowing them to approve values of a variable conditionally on the values of other variables. We study thr...

متن کامل

Computational Aspects of Multi-Winner Approval Voting

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for d...

متن کامل

Is Approval Voting Optimal Given Approval Votes?

Some crowdsourcing platforms ask workers to express their opinions by approving a set of k good alternatives. It seems that the only reasonable way to aggregate these k-approval votes is the approval voting rule, which simply counts the number of times each alternative was approved. We challenge this assertion by proposing a probabilistic framework of noisy voting, and asking whether approval v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005